NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
961	PDF Document Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-11-04 11:56:54 Graph Tree NP-complete problems Spanning tree Graph partition Planar separator theorem Graph theory Mathematics Theoretical computer science
962	Approaching Optimality For Solving SDD Linear Systems Ioannis Koutis Carnegie Mellon University Email: [removed] Gary L. Miller Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-08-23 12:08:01 NP-complete problems Spanning tree Line graph Time complexity Planar graph Graph partition Minor Trapezoid graph Eulerian path Graph theory Theoretical computer science Mathematics
963	Probabilistic Graph and Hypergraph Matching Ron Zass and Amnon Shashua School of Computer Science and Engineering The Hebrew University of Jerusalem zass,[removed] Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2008-04-08 07:15:41 NP-complete problems Matching Combinatorial optimization Hypergraph 3-dimensional matching Graph Line graph Vertex cover Graph theory Mathematics Theoretical computer science
964	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 12, Add to Reading List Source URL: sensorweb.cs.gsu.edu Language: English - Date: 2013-04-05 09:44:29 NP-complete problems Graph coloring Network topology Networks Wireless networking Unit disk graph Routing Distributed computing Mesh networking Graph theory Theoretical computer science Mathematics
965	The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2007-10-29 20:04:40 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Conjunctive normal form Local search PP NP-complete Theoretical computer science Computational complexity theory Applied mathematics
966	Derandomized Graph Products Noga Alon ∗ Uriel Feige† Add to Reading List Source URL: www.tau.ac.il Language: English - Date: 2002-02-21 20:23:30 NP-complete problems Graph coloring Clique Graph operations Independent set Clique problem Line graph Graph theory Theoretical computer science Mathematics
967	PDF Document Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-12-06 15:39:06 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Network flow NP-complete problems Graph theory Immerman–Szelepcsényi theorem Push-relabel maximum flow algorithm Theoretical computer science Computational complexity theory Mathematics
968	A Graphical Model for Simultaneous Partitioning and Labeling Philip J. Cowans Cavendish Laboratory, University of Cambridge, Cambridge, CB3 0HE, United Kingdom [removed] Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2004-11-25 09:53:24 Graph operations NP-complete problems Clique Graph Tree decomposition Markov random field Degeneracy Path decomposition Modular decomposition Graph theory Mathematics Theoretical computer science
969	Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:06 NP-complete problems Matching Combinatorial optimization Graph coloring Vertex cover Bipartite graph Adjacency matrix Independent set Shortest path problem Graph theory Mathematics Theoretical computer science
970	Matching as a Non-Cooperative Game Andrea Albarelli, Samuel Rota Bul`o, Andrea Torsello, and Marcello Pelillo Dipartimento di Informatica - Universit`a Ca’ Foscari via Torino, [removed]Venice Italy {aalbarel,srotab Add to Reading List Source URL: www.select.cs.cmu.edu Language: English - Date: 2009-11-17 22:13:37 Game theory NP-complete problems Combinatorial optimization Matching Nash equilibrium Subgraph isomorphism problem Pattern matching Theoretical computer science Mathematics Computational complexity theory

UPDATE